Computational complexity of mathematical operations

Results: 76



#Item
71235  Doc. Math. J. DMV

235 Doc. Math. J. DMV

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2012-04-18 10:55:30
72The Design of Approximation Algorithms

The Design of Approximation Algorithms

Add to Reading List

Source URL: www.designofapproxalgs.com

Language: English - Date: 2013-10-23 21:30:01
732008 G¨odel Prize Citation The 2008 G¨

2008 G¨odel Prize Citation The 2008 G¨

Add to Reading List

Source URL: www.eatcs.org

Language: English - Date: 2009-11-03 08:49:32
74Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time DANIEL A. SPIELMAN

Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time DANIEL A. SPIELMAN

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2007-02-04 13:37:47
75

"Shortest Path problem, the Traveling Salesman problem, or the Knapsack problem, are a few of the many combinatorial optimization problems, which have very wide applications in all spheres of our lives. Unfortunately, there is a large class of problems, denoted by class NP, for

Add to Reading List

Source URL: www.iitk.ac.in

Language: English - Date: 2004-12-03 00:57:05
76

PDF Document

Add to Reading List

Source URL: www.renyi.hu

Language: English - Date: 2006-11-05 15:15:43